Computing the Partial Word Avoidability Indices of Ternary Patterns
نویسندگان
چکیده
We study pattern avoidance in the context of partial words. The problem of classifying the avoidable binary patterns has been solved, so we move on to ternary and more general patterns. Our results, which are based on morphisms (iterated or not), determine all the ternary patterns’ avoidability indices or at least give bounds for them.
منابع مشابه
Computing the partial word avoidability indices of binary patterns
We complete the classification of binary patterns in partial words that was started in earlier publications by proving that the partial word avoidability index of the binary pattern ABABA is two and the one of the binary pattern ABBA is three.
متن کاملAbelian Pattern Avoidance in Partial Words
Pattern avoidance is an important topic in combinatorics on words which dates back to the beginning of the twentieth century when Thue constructed an infinite word over a ternary alphabet that avoids squares, i.e., a word with no two adjacent identical factors. This result finds applications in various algebraic contexts where more general patterns than squares are considered. On the other hand...
متن کاملUnary Pattern Avoidance in Partial Words Dense with Holes
A partial word is a sequence of symbols over a finite alphabet that may have some undefined positions, called holes, that match every letter of the alphabet. Previous work completed the classification of all unary patterns with respect to partial word avoidability, as well as the classification of all binary patterns with respect to non-trivial partial word avoidability. In this paper, we pose ...
متن کاملOn the Unavoidability of k-Abelian Squares in Pure Morphic Words
We consider a recently defined notion of k-abelian equivalence of words by concentrating on avoidability problems. The equivalence class of a word depends on the number of occurrences of different factors of length k for a fixed natural number k and the prefix of the word. We show that over a ternary alphabet, k-abelian squares cannot be avoided in pure morphic words for any natural number k. N...
متن کاملAvoidability of long k-abelian repetitions
We study the avoidability of long k-abelian-squares and k-abeliancubes on binary and ternary alphabets. For k = 1, these are Mäkelä’s questions. We show that one cannot avoid abelian-cubes of abelian period at least 2 in infinite binary words, and therefore answering negatively one question from Mäkelä. Then we show that one can avoid 3-abelian-squares of period at least 3 in infinite binary wo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Discrete Algorithms
دوره 23 شماره
صفحات -
تاریخ انتشار 2012